Search-based Planning: A Method for Character Behaviour
نویسندگان
چکیده
In this paper we present experiments with search-based planning as the most generic description of intelligent behaviour for virtual actors. Using a MinMin heuristic search-based planner (HSP), we demonstrate how this can be used to generate efficient plans (in terms of plan length), and how the production of these minimum length plans is performed in times suitable for the real-time 3D virtual environments. Using an extension to the classical 'dinner-date' problem, we illustrate the planning and action execution undertaken by the virtual actor.
منابع مشابه
Search-based Planning for Character Animation
Planning is the most generic AI technique to generate intelligent behaviour for virtual actors, in computer animation or computer games. In the animation domain, planning capabilities will consist in finding a right sequence of actions that let an agent achieve pre-defined goals. Each action generated can be played in the environment to produce an animation. Hence entire animations can be gener...
متن کاملPlanning characters' behaviour in interactive storytelling
In this paper, we describe a method for implementing the behaviour of artificial actors in the context of interactive storytelling. We have developed a fully implemented prototype based on the Unreal TournamentTM game engine, and carried experiments with a simple sitcom-like scenario. We discuss the central role of artificial actors in interactive storytelling and how real-time generation of th...
متن کاملA graph search algorithm: Optimal placement of passive harmonic filters in a power system
The harmonic in distribution systems becomes an important problem due to an increase in nonlinear loads. This paper presents a new approach based on a graph algorithm for optimum placement of passive harmonic filters in a multi-bus system, which suffers from harmonic current sources. The objective of this paper is to minimize the network loss, the cost of the filter and the total harmonic disto...
متن کاملA grasp-based motion planning algorithm for character animation
The design of autonomous characters capable of planning their own motions continues to be a challenge for computer animation. We present a novel kinematic motion planning algorithm for character animation which addresses some of the outstanding problems. The problem domain for our algorithm is as follows: given a constrained environment with designated handholds and footholds, plan a motion thr...
متن کاملOptimization of Mixed-Integer Non-Linear Electricity Generation Expansion Planning Problem Based on Newly Improved Gravitational Search Algorithm
Electricity demand is forecasted to double in 2035, and it is vital to address the economicsof electrical energy generation for planning purposes. This study aims to examine the applicability ofGravitational Search Algorithm (GSA) and the newly improved GSA (IGSA) for optimization of themixed-integer non-linear electricity generation expansion planning (GEP) problem. The performanceindex of GEP...
متن کامل